#pragma comment(linker, "/STACK:10000000")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#include <cassert>
#include <string>
#include <cstring>
#define ldb long double
#define LL long long
#define fi first
#define se second
#define fill(a, c) memset(a, c, sizeof(a))
#define sqr(a) ((a) * (a))
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define getBit(mask, k) (((mask) / pw[k]) % pw[1])
#define setBit(mask, k, l) (((mask) / pw[k + 1] * pw[1] + (l)) * pw[k] + ((mask) % pw[k]))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
const ldb LDINF = 9128739847123.00;
const ldb eps = 1e-9;
const int INF = 1 << 30;
const ldb pi = fabsl(atan2(0.0, -1.0));
using namespace std;

int x, y;
void Load()
{
	cin >> x >> y;

}

void Solve()
{
	int w = 1;
	while (true)
	{
		w ^= 1;
		if (w == 0)
		{    
			
			if (x == 0)
			{
				if (y < 22)
				{
					printf("Hanako");
					return;
				}
				y -= 22;
				continue;
			}
			if (x == 1)
			{
				if (y < 12)
				{
					printf("Hanako");
					return;
				}
				x -= 1;
				y -= 12;
				continue;
			}
			if (x >= 2)
			{
				if (y < 2)
				{
					printf("Hanako");
					return;
				}
				x -= 2;
				y -= 2;
				continue;
			}
			continue;
		}
		int sum = 0;
		for (; y && sum < 220; sum += 10, y--);
		if (sum == 220) continue;
		if (sum >= 120 && x >= 1)
		{
			x--;
			y += (sum - 120) / 10;
			continue;
		}
		if (sum >= 20 && x >= 2)
		{
			x -= 2;
			y += (sum - 20) / 10;

			continue;
		}
		printf("Ciel");
		return;
	}

}

#define file "a"
int main()
{
	#ifndef ONLINE_JUDGE
		freopen(file".in", "rt", stdin);
		freopen(file".out", "wt", stdout);
	#endif
	Load();
	Solve();
	return 0;
}
